An algorithm to construct Gröbner bases for solving integration by parts relations
نویسندگان
چکیده
منابع مشابه
An Algorithm to Construct Gröbner Bases for Solving Integration by Parts Relations
This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for constructing Gröbner-type bases associated with polynomials of shift operators. The algorithm is used for calculating Feynman integrals and has proven itself efficient in several complicated cases. E-mail: [email protected] Supported in part by RFBR, grant 05-01-00988
متن کاملGröbner Bases: An Introduction
The method (theory plus algorithms) of Gröbner bases provides a uniform approach to solving a wide range of problems expressed in terms of sets of multivariate polynomials. x y 2y z z 0 y 2 x 2 z x z 0 z 2 y 2 x x 0 Example: kinematic equations of a robot. algebraic geometry, commutative algebra, polynomial ideal theory invariant theory automated geometrical theorem proving Groebner-Bases.nb 1
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولMultiplicative Bases, Gröbner Bases, and Right Gröbner Bases
Before surveying the results of the paper, we introduce path algebras. Path algebras play a central role in the representation theory of finite-dimensional algebras (Gabriel, 1980; Auslander et al., 1995; Bardzell, 1997) and the theory of Gröbner bases (Bergman, 1978; Mora, 1986; Farkas et al., 1993) has been an important tool in some results (Feustel et al., 1993; Green and Huang, 1995; Bardze...
متن کاملSolving thousand-digit Frobenius problems using Gröbner bases
A Gröbner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible decompositions and Hilbert functions are also presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2006
ISSN: 1029-8479
DOI: 10.1088/1126-6708/2006/04/026